A Greedy-based Algorithm in Optimizing Student’s Recommended Timetable Generator with Semester Planner
نویسندگان
چکیده
Semester planner plays an essential role in students’ society that might help students have self-discipline and determination to complete their studies. However, during the COVID-19 pandemic, they faced difficulty organizing time management doing a manual schedule. It resulted substantial disruptions learning, internal assessment disturbances, cancellation of public evaluations. Hence, this research aims optimize recommended semester planner, Timetable Generator using greedy algorithm increase student productivity. We identified three-set control functions for each entered information: 1) validation inserted information ensure valid data no redundancy, 2) focus scale, 3) number hours finish activity. calculate priority task sequence achieve best optimal solution. The can solve optimization problem with solution situation. Then, we executed it make planner. From test conducted, functionality shows all features successfully passed. validate accuracy system’s reliability by evaluating compared Brute Force algorithm, trends from 60% 100%.
منابع مشابه
A Multiple-Neighborhoods-Based Simulated Annealing Algorithm for Timetable Problem
This paper presents a simulated annealing algorithm that based on multiple search neighborhoods to solve a special kind of timetable problem. The new algorithm also can solve those problems that can be solved by local search algorithm. Various experimental results show that the new algorithm can actually give more satisfactory solutions than general simulated annealing algorithm can do.
متن کاملOASIS: An Optimizing Action-Based Compiler Generator
Action Semantics is a new and interesting foundation for semantics based compiler generation. In this paper we present several analyses of actions, and apply them in a compiler generator capable of generating efficient, optimizing compilers for procedural and functional languages with higher order recursive functions.The automatically generated compilers produce code that is comparable with cod...
متن کاملA Greedy Algorithm with Forward-Looking Strategy
The greedy method is a well-known technique for solving various problems so as to optimize (minimize or maximize) specific objective functions. As pointed by Dechter et al [1], greedy method is a controlled search strategy that selects the next state to achieve the largest possible improvement in the value of some measure which may or may not be the objective function. In recent years, many mod...
متن کاملA General Greedy Approximation Algorithm with Applications
Greedy approximation algorithms have been frequently used to obtain sparse solutions to learning problems. In this paper, we present a general greedy algorithm for solving a class of convex optimization problems. We derive a bound on the rate of approximation for this algorithm, and show that our algorithm includes a number of earlier studies as special cases.
متن کاملGenetic Algorithm Based Generator Scheduling-A Review
Generator Scheduling (GS) problemis a non-linear, mixed integer, combinatorial and constrained optimization problem. The main objective of generator scheduling is to prepare the most economic startup and shutdown schedule for generators to meet the forecasted load demand and spinning reservefor a scheduled time horizon while satisfying various constraints. GS problemcan be realized as two inter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2022
ISSN: ['2158-107X', '2156-5570']
DOI: https://doi.org/10.14569/ijacsa.2022.0130146